Graph refining via iterative regularization framework
نویسندگان
چکیده
منابع مشابه
Bayesian Regularization via Graph Laplacian
Regularization plays a critical role in modern statistical research, especially in high dimensional variable selection problems. Existing Bayesian methods usually assume independence between variables a priori. In this article, we propose a novel Bayesian approach, which explicitly models the dependence structure through a graph Laplacian matrix. We also generalize the graph Laplacian to allow ...
متن کاملTensor MRI Regularization via Graph Diffusion
A new method for diffusion tensor (DT) image regularization is presented that relies on heat diffusion on discrete structures. We represent a DT image using a weighted undirected graph, where the weights of the edges are determined from the geometry of the white matter fiber pathways. Diffusion across this weighted graph is captured by the heat equation, and the solution, i.e. the heat kernel, ...
متن کاملA Framework for Regularization via Operator Approximation
Regularization approaches based on spectral filtering can be highly effective in solving ill-posed inverse problems. These methods, however, require computing the singular value decomposition (SVD) and choosing appropriate regularization parameters. These tasks can be prohibitively expensive for large-scale problems. In this paper, we present a framework that uses operator approximations to eff...
متن کاملA Regularization Framework for Learning from Graph Data
The data in many real-world problems can be thought of as a graph, such as the web, co-author networks, and biological networks. We propose a general regularization framework on graphs, which is applicable to the classification, ranking, and link prediction problems. We also show that the method can be explained as lazy random walks. We evaluate the method on a number of experiments.
متن کاملIterative Regularization and MINRES
In this paper we present three theorems which give insight into the regularizing properties of MINRES. While our theory does not completely characterize the regularizing behavior of the algorithm, it provides a partial explanation of the observed behavior of the method. Unlike traditional attempts to explain the regularizing properties of Krylov subspace methods, our approach focuses on converg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Applied Sciences
سال: 2019
ISSN: 2523-3963,2523-3971
DOI: 10.1007/s42452-019-0412-9